Optimal keyword auctions for optimal user experiences

نویسندگان

  • Jun Li
  • De Liu
  • Shulin Liu
چکیده

Poor user experiences with search advertisements can lead to ad avoidance thus reduce search engine’s long-term revenue. We capture the effect of negative user experiences on search engine’s future revenue in a new variable called “shadow costs” and examine the optimal keyword auction mechanisms (KAMs) in a general model that takes into account advertiserspecific and position-specific shadow costs. We show that the optimal KAMs can be implemented in an ex-post equilibrium with a “progressive second price” payment rule. Furthermore, under a few special but practically relevant cases, the optimal KAM takes the form of relatively simple scoring auctions. We show that minimum bids in these scoring auctions may be advertiseror positionspecific and the allocation rule may or may not be greedy. Our results highlight impact of shadow costs on keyword auction designs and hold implications for search engines, advertisers, and Internet users.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Keyword Auctions with Shadow Costs

Search engines incur shadow costs whenever an advertisement negatively affects user experiences, which damages the search engine’s long-run revenue. We characterize the optimal mechanism for keyword advertising in a general framework that accommodates clickthrough rates and shadow costs that can differ across advertisers and positions. We show that shadow costs significantly affect how advertis...

متن کامل

Optimal Bidding Strategy for Keyword Auctions and Other Continuous-time Markets

This paper models continuous-time mass bidding markets, such as keyword auctions and market-based resource allocation systems, as a stochastic dynamic system that fluctuates around an average value under the influence of its users. The user’s objective to maximize his long-term average utility is formulated as a stochastic control problem. The optimal bidding strategy is calculated both analyti...

متن کامل

Truthful polynomial time optimal welfare keyword auctions with budget constraints

In keyword auctions, advertisers bid for keywords. Currently, bids and allocations are made on a per keyword basis. We show that this mechanism is neither efficient nor truthful under demand or budget constraints and provide a truthful efficient (quasi) polynomial mechanism for allocating keywords under budget constraints. As a side effect our proposed mechanism has higher revenue than the curr...

متن کامل

Is Efficiency Expensive?

We study the simultaneous optimization of efficiency and revenue in pay-per-click keyword auctions in a Bayesian setting. Our main result is that the efficient keyword auction yields near-optimal revenue even under modest competition. In the process, we build on classical results in auction theory to prove that increasing the number of bidders by the number of slots outweighs the benefit of emp...

متن کامل

A Comparative Study of Multi-Attribute Continuous Double Auction Mechanisms

Auctions have been as a competitive method of buying and selling valuable or rare items for a long time. Single-sided auctions in which participants negotiate on a single attribute (e.g. price) are very popular. Double auctions and negotiation on multiple attributes create more advantages compared to single-sided and single-attribute auctions. Nonetheless, this adds the complexity of the auctio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Decision Support Systems

دوره 56  شماره 

صفحات  -

تاریخ انتشار 2013